Principal Feature Classification [Brief Papers] - Neural Networks, IEEE Transactions on

نویسندگان

  • Qi Li
  • Donald W. Tufts
چکیده

The concept, structures, and algorithms of principal feature classification (PFC) are presented in this paper. PFC is intended to solve complex classification problems with large data sets. A PFC network is designed by sequentially finding principal features and removing training data which has already been correctly classified. PFC combines advantages of statistical pattern recognition, decision trees, and artificial neural networks (ANN’s) and provides fast learning with good performance and a simple network structure. For the real-world applications of this paper, PFC provides better performance than conventional statistical pattern recognition, avoids the long training times of backpropagation and other gradient-decent algorithms for ANN’s, and provides a low-complexity structure for realization.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Growing subspace pattern recognition methods and their neural-network models

In statistical pattern recognition, the decision of which features to use is usually left to human judgment. If possible, automatic methods are desirable. Like multilayer perceptrons, learning subspace methods (LSMs) have the potential to integrate feature extraction and classification. In this paper, we propose two new algorithms, along with their neural-network implementations, to overcome ce...

متن کامل

Toward a completely automatic neural-network-based human chromosome analysis

The application of neural networks (NNs) to automatic analysis of chromosome images is investigated in this paper. All aspects of the analysis, namely segmentation, feature description, selection and extraction, and classification, are studied. As part of the segmentation process, the separation of clusters of partially occluded chromosomes, which is the critical stage that state-of-the-art chr...

متن کامل

Detection of mines and minelike targets using principal component and neural-network methods

This paper introduces a new system for real-time detection and classification of arbitrarily scattered surface-laid mines from multispectral imagery data of a minefield. The system consists of six channels which use various neural-network structures for feature extraction, detection, and classification of targets in six different optical bands ranging from near UV to near IR. A single-layer aut...

متن کامل

Limitations of nonlinear PCA as performed with generic neural networks

Kramer's nonlinear principal components analysis (NLPCA) neural networks are feedforward autoassociative networks with five layers. The third layer has fewer nodes than the input or output layers. This paper proposes a geometric interpretation for Kramer's method by showing that NLPCA fits a lower-dimensional curve or surface through the training data. The first three layers project observation...

متن کامل

Convex Formulation for Kernel PCA and its Use in Semi-Supervised Learning

In this brief, kernel principal component analysis (KPCA) is reinterpreted as the solution to a convex optimization problem. Actually, there is a constrained convex problem for each principal component, so that the constraints guarantee that the principal component is indeed a solution, and not a mere saddle point. Although these insights do not imply any algorithmic improvement, they can be us...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1998